A Relation Routing Scheme for Distributed Semantic Media Query
نویسندگان
چکیده
منابع مشابه
A Relation Routing Scheme for Distributed Semantic Media Query
Performing complex semantic queries over large-scale distributed media contents is a challenging task for rich media applications. The dynamics and openness of data sources make it uneasy to realize a query scheme that simultaneously achieves precision, scalability, and reliability. In this paper, a novel relation routing scheme (RRS) is proposed by renovating the routing model of Content Centr...
متن کاملSemantic Methods for P2P Query Routing
Knowledge sharing in a virtual organization requires a knowledge life cycle including knowledge provisioning, terminology alignment, determination of resource location, query routing, and query answering. In this talk we focus on the issue of determining a relevant resource in a completely decentralized setting such as necessitated by peer-to-peer knowledge management in virtual organizations. ...
متن کاملSemantic Query Routing for Ontological Knowledge Chain
With a large quantity of data and services existing in virtual organization, query routing is an efficient approach to satisfy entities on community for their requirements of knowledge. The entities, which are organized according to the semantic relationship of each other, together with the query routing method under the guidance of semantics, endeavor to meet the querist with the most relevant...
متن کاملSemantic-based Query Routing for PDMS
Query routing is a key issue in dynamic distributed environments such as Peer Data Management Systems (PDMS). The dynamicity of the environment and the amount of heterogeneous and autonomous data sources available in the system have made hard the task of finding relevant results to user queries. We argue that the semantic knowledge around this process is rather important to select the most rele...
متن کاملSemantic Query Routing Experiences in a PDMS
Querying a PDMS means either flooding the network with messages to all peers or taking advantage of a routing mechanism to reformulate a query only on the best peers selected according to some given criteria. As reformulations may lead to semantic approximations, we deem that such approximations can be exploited for locating the semantically best directions to forward a query to. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Scientific World Journal
سال: 2013
ISSN: 1537-744X
DOI: 10.1155/2013/915963